Information processing system, information processing method, computer program, storage medium, and program transmission apparatus

ABSTRACT

It is an object of the present invention to prepare information that is defined by a search query and the act of collecting and analyzing the information for a specific purpose, and to provide new information collection and analysis means for the management of knowledge. An information processing system includes: a data knowledge request processor and a data knowledge request log, for obtaining a log for operations performed during information processing; a knowledge search processor, for setting, as nodes on a graph, the operations of the log obtained by the data knowledge request processor and the data knowledge request log, and for connecting the nodes with arcs in the order of the performance of the operations to prepare a graph that represents a transient condition wherein the operations are shifted; and a knowledge synthesis/display processor, for visually presenting the graph prepared by the knowledge search processor.

BACKGROUND

1. Field of the Invention

The present invention relates to an information processing method fordescribing, in a graph that can be visually evaluated, an informationsearch process and its transient condition, and for supporting theevaluation and processing of the graph.

2. Related Art

Recently, as people have come to realize how important knowledgemanagement is to a business, “knowledge” for fully utilizinginformation, means for “correlating” information and a systematic methodfor “tracking correlation” have been requested, and for these objectsvarious methods have been proposed.

Conventional techniques represent and manage the information utilizationmethod, from the viewpoint of database transactions and work flow.Specifically, well known methods are available that employ descriptionlanguages (e.g., UML) to describe processes using graphs, and methodsfor storing search sequences in a database system as routine processes.

These methods have as their main objects the acquisition of knowledgeconcerning procedures and the intercorrelation of proceduralinformation, and in the analysis processes performed using thesemethods, only procedural differences are detected. For example, when theUML language is employed, procedures for the processing of informationare described, and even when the object and target data are similar, dueto procedural differences, information utilization methods tend to berepresented by completely different graphs.

As is described above, a conventional technique that provides“knowledge” for managing information, means for “correlating” differentitems of information with each other, and a systematic method for“tracking correlation” are provided from the viewpoint of the databasetransactions and work flow. As a result, it was difficult to shareknowledge with others and to re-use knowledge.

To write a process in a description language, such as the UML, theprocedures for “how to” handle information are written as is describedabove. In other words, the description of the information itself, i.e.,“what” is to be searched for and analyzed, is not the main object.Therefore, even when the object and the target data are similar, theprocesses tend to be represented by completely different graphs due toprocedural differences, and it is extremely difficult to search for andre-use a similar graph.

Further, according to a method whereby a process sequence for a databasesearch is stored as a routine process for a system, merely the naming isavailable for the routine process, and the sharing of knowledge withothers and the re-use of the knowledge are difficult.

SUMMARY OF THE INVENTION

It is, therefore, one object of the present invention to prepareinformation that is defined by a search query and the act of collectingand analyzing the information for a specific purpose, and to provide newinformation collection and analysis means for the management ofknowledge.

It is another object of the present invention to implement a knowledgeexpression with which it is easy to identify similarities between graphswhereby information and the act of collecting and analyzing it aredescribed, and to make it possible to re-use a graph that has beenprepared.

To achieve the above objects, according to the present invention, aninformation processing system with the following configuration isprovided. Specifically, the information processing system comprises: logacquisition means, for obtaining a log for operations performed duringinformation processing; graph preparation means, for setting, as nodeson a graph, the operations of the log obtained by the log acquisitionmeans, and for connecting the nodes with arcs in the order of theperformance of the operations to prepare a graph that represents atransient condition wherein the operations are shifted; and graphdisplay means, for visually presenting the graph prepared by the graphpreparation means.

A variety of information processing operations are performed to providethe log and to prepare the graph. In particular, these operations can bethose whereby, during a database search, data are narrowed down bychanging the item searched for or the search conditions, and the desireddata is obtained by repeating the search.

The information processing system further comprises: graph storagemeans, for storing the graph that is prepared; and search means, forsearching for the graph stored in the graph storage means using, as asearch key, an arbitrary node or arc, or a path consisting of a sequenceof nodes and arcs. In this case, the graph display means can display thegraph detected by the search means.

The information processing system further comprises: graph editingmeans, for editing the prepared graph by dividing the graph at anarbitrary location and connecting an arbitrary node to an arbitrary arc.In this case, the graph display means can display a graph edited by thegraph display means.

It is preferable that a GUI be used for the editing operation, and thata pointing device or a keyboard be employed while referring to thedisplayed graph. An editing function that is mounted using conventionalgraphic software can be employed as means for implementing the GUIoperation.

The information processing system further comprises: informationprocessing means, for employing the graph as a script, and formechanically performing operations specified at the nodes of the graphin the order indicated by the arcs in the graph.

This configuration is preferable because once a user prepares a graphfor his or her operation, the operation can be performed automaticallyin accordance with the graph.

The information processing system further comprises: radar chartpreparation means, for arranging operations for information processingaround the circumference of a circle and preparing a radar chart thatrepresents conditions for the operations using distances from the centerof the circle, and for arranging and displaying the nodes of the graphat predetermined locations on the radar chart; and list preparationmeans, for preparing a list wherein the nodes on the radar chart arecorrelated with the results obtained by operations corresponding to thenodes.

This configuration is preferable because the results of operations canbe evaluated in detail using the radar chart.

Further, according to the present invention, an information processingsystem having the following configuration can be provided. Specifically,the information processing system comprises: database search means, forsearching a data base for desired data; display means, for displayingsearch results obtained by the database search means; radar chartpreparation means, for arranging operations for a data search around thecircumference of a circle and preparing a radar chart that representsconditions for the operations using distances from the center of thecircle, and for arranging and displaying a node at a location on theradar chart that corresponds to the search result obtained by thedatabase searching means; and list preparation means for preparing alist wherein the node on the radar chart is correlated with dataobtained by the database search means.

The information processing system further comprises: interface means,for moving, in the radial direction of the radar chart, the node on theradar chart that is displayed by the display means and for positioningthe node at an arbitrary position, so as to permit the database searchmeans to search the database under a condition indicated by the locationon the radar chart, and to permit the list preparation means to preparea list that reflects the search results.

According to the present invention, an information processing method,whereby transient conditions for an information processing operation arewritten using a descriptive form that enables the transient conditionsto be visually evaluated, comprises the steps of: setting up theinformation processing operation as nodes in the descriptive form;setting the execution order of the information processing operationsusing arcs to be extended from node to node; and connecting the nodesusing the arcs to write the transient conditions using the descriptiveform so that the transient conditions can be visually evaluated.

For this invention a variety of operations for information processingcan be written. In particular, these operations can be those where,during a database search, data choices are narrowed down by changing asearch item or a search condition, and the search is repeated to obtaindesired data.

The information processing operations are those for searching a databasefor desired data, and each of the operations corresponding to the nodescorresponds to a query having a predetermined form.

A general-purpose query, such as an SQL query or a request for afull-text search, can be employed for a search.

Further, a transient condition concerning the information processingoperations between nodes before and after each of the arcs is written asan annotation, in an arbitrary expression, by a user and the annotationis added to the arcs.

According to the present invention, an information processing methodhaving the following configuration can be provided. Specifically, theinformation processing method comprises the steps of: obtaining a logfor operations performed during information processing; setting, asnodes on a graph, the operations recorded in the log, and connecting thenodes with arcs, in the order in which the operations are performed, toprepare a graph representing a transient condition wherein theoperations are shifted; and visually presenting the prepared graph.

The information processing method further comprises the steps of:storing and accumulating the graph that are prepared; searching for adifferent graph that includes all or part of a predetermined graphrepresenting a predetermined operating sequence, and that has a nodecorresponding to a preceding or succeeding operation; and adding, to thepredetermined graph, the node that corresponds to the preceding orsucceeding operation of the common portion of the different graph, andan arc directing to the node.

With this configuration, conventional graphs can be combined to obtain agraph corresponding an operation that corresponds to the object of theuser.

The information processing method further comprises the steps of:storing and accumulating graphs that are prepared; searching for graphsthat correspond to an operating sequence whereby predetermined operatingresults are available; and selecting a desired graph from among thegraphs obtained by the search, and connecting the desired graph to agraph that corresponds to another operation for which the resultsobtained through an operation consonant with the desired graph areemployed.

This configuration is preferable because when a plurality of types ofoperating sequences are used to obtain predetermined results, the mostefficient procedures that match the object of the user can be obtained.

The information processing method further comprises the step of:arranging operating items for information processing around thecircumference of a circle and preparing a radar chart that representsconditions for the operations using distances from the center of thecircle, and arranging and displaying the nodes of the graph atpredetermined locations on the radar chart.

Since the graph is projected onto the radar chart, the operations can beevaluated in detail.

According to the present invention, a computer program that permits acomputer to perform the following processes can be provided.Specifically, the computer program permits a computer to perform: aprocess for obtaining a log for operations during informationprocessing; a process for setting, as nodes on a graph, the operationsrecorded the obtained log, and for connecting the nodes with arcs in theorder of the performance of the operations to prepare graphs thatrepresent a transient condition wherein the operations are shifted; aprocess for accumulating the graphs that are prepared; a process forsearching for a desired graph using, as a search key, an arbitrary nodeor arc, or a path consisting of a sequence of nodes and arcs; a processfor editing the graph that is prepared or the desired graph that isobtained by the search; and a process for visually presenting the graphprovided by editing.

According to the present invention, a storage medium can be provided onwhich input means of a computer stores a computer-readable program, andfurther, a program transmission apparatus can be provided that readsthis computer-readable program from the storage means.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a diagram showing an example information flow graph used forone embodiment of the present invention.

FIG. 2 is a diagram for explaining the configuration of an informationflow graph control system according to the embodiment.

FIG. 3 is a detailed diagram for explaining a data processing hardwareunit and an interactive hardware unit that constitute the hardwareblocks of the information flow graph control system in FIG. 2.

FIG. 4 is a detailed diagram for explaining the data knowledge managerand an interactive data knowledge operating unit that constitute thesoftware blocks of the information flow graph control system in FIG. 2.

FIG. 5 is a flowchart for explaining the processing for generating a newinformation flow graph according to the embodiment.

FIG. 6 is a flowchart for explaining the processing for searching for aconventional information flow graph according to the embodiment.

FIG. 7 is a diagram for explaining the state for generating a moredetailed information flow graph according to the embodiment.

FIG. 8 is a flowchart for explaining the processing for preparing a moredetailed information flow graph.

FIG. 9 is a diagram showing the state for the case generation of theinformation flow graph in accordance with the case.

FIG. 10 is a flowchart for explaining the processing for case generationthe information flow graph in accordance with the case.

FIG. 11 is a diagram showing the state for the correlation ofinformation flow graphs according to the embodiment.

FIG. 12 is a flowchart for explaining the processing for the correlationof the information flow graphs.

FIG. 13 is a diagram showing a radar chart using an information flowgraph and a list of information corresponding to the radar chart that isobtained.

FIG. 14 is a flowchart for explaining the information processingperformed using the radar chart according to the embodiment.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

The preferred embodiment of the present invention will now be describedin detail while referring to the accompanying drawings.

The overview of the present invention will now be described. In thisinvention, an information flow graph is proposed wherein information andits utilization and correlation are written. The information flow is amodel that describes a target information source, a series of searchforms that are used for a determination or to characterize importantinformation, and the employment of the decision or a filter. An analysisof the information is defined as a node, and the node is represented bya graph, including arcs that have branch conditions or transientcondition. When such a data structure is employed, the performances ofinformation analyses and information utilization can correspond tographs that represent information flow having the individual shapes.

Therefore, an information flow graph can be used for the followingobjects.

-   -   1. The periodical interpretation of a description is performed,        and information that satisfies the description is extracted, or        an analysis of the information is distributed to a user.    -   2. The search for and re-use of multiple results obtained        through analysis or utilization of information based on the same        type of information.    -   3. The synthesis of graphs to perform information analysis and        information utilization at a higher level. Since the information        flow graph is employed for the above object, how to utilize the        information can be shared with an organization or users.        Further, since the information flow graph is collectively        processed, a large problem encountered in knowledge management,        such as efficiently coping with an information request or the        designation of an information resource that serves as the        nucleus of the organization, can be resolved. Further, since the        information flow graph represents only target information, i.e.,        “what” is to be searched for or analyzed, to search for a        similar graph and to re-use of the graph is easy, and the        knowledge expression is easy to understand by another user.

The information flow graph will now be described in more detail. Theinformation flow graph is a directed graph representing an informationrequest by a user and that includes nodes, each of which indicate aninformation search form, and arcs that represent conditional branchesand cases. When the search results obtained immediately before areemployed to narrow down information or to re-use information, the twonodes for the search results are connected by an arc. In addition, theinformation flow graph can be interpreted as a script for collecting andsearching for a series of relating information. Therefore, when the userdesignates the information flow graph as a script, the system canperiodically execute the procedures written in the information flowgraph.

FIG. 1 is a diagram showing an example information flow graph.

In FIG. 1, when a start node (hereinafter referred to as node 1) is theorigin, two routes are shown that lead to a node 4 whereat aninformation request to “select, from the latest 100 articles, articlesthat include company names (the top ten) that appeared frequently” iswritten. One route advances from node 1 to node 4 via a node 2, whereatan information request to “obtain from today's news the names of the topten companies in the descending order of the frequency of theirappearance” is written. The other route advances from node 1 to node 4via a node 3, whereat an information request to “search today's news forthe latest 100 articles and list in order beginning with the latestdate” is written. That is, it is apparent that to obtain the informationrepresented at node 4, there is a method according to which theprocedure at node 2 is performed first and then the top ten companynames that are obtained are used to perform the procedure at node 4, anda method according to which the procedure at node 3 is performed firstand then the 100 articles that are obtained are used to perform theprocedure at node 4.

It should be noted that the information requests written as remarks inFIG. 1 (“obtain from today's news the names of the top ten companies inthe descending order of the frequency of their appearance” and “searchtoday's news for the latest 100 articles and list in order beginningwith the latest date”) are actually supposed to be expressed by using apredetermined search format, such as an SQL query or a request that afull-text search be performed. Since a predetermined search format isemployed, the appropriateness for a general-purpose application, or theusability when the information flow graph is referred to or is employedas a script can be improved. It is not always necessary for aninformation request to be expressed by using an SQL query or a requestfor a full-text search, and a user can employ an arbitrary search formatto describe an information request.

An annotation that indicates a transient condition for a procedure foreach node is provided for each of the arcs of the information flowgraph. Specifically, an annotation “company name”, which indicates theacquisition of company names at node 2, is added to the arc extendingfrom node 1 to node 2, and an annotation “an article including a companyname”, which indicates the acquisition at node 4 of an article in whicha company name is included, is added to the arc extending from node 2 tonode 4. Similarly, an annotation “topic”, which indicates theacquisition of a news article at node 3, is added to the arc extendingfrom node 1 to node 3, and an annotation “the latest article”, whichindicates the acquisition at node 4 of the latest article, is added tothe arc extending from node 3 to node 4.

An information request written at a node describes the procedure that isactually to be performed, while an annotation added to an arc indicatesthe reason for which the procedure is to be performed. Therefore,although an arbitrary annotation may be provided by a user, such anannotation need not always be furnished.

The evaluation and the processing of the information using the thusarranged information flow graph can be employed not only to provide adescription of the operations performed for the database in accordancewith the information requests, but also to provide a description of thevarious operations that are employed for information processing and ofthe evaluation and the processing of the information.

An explanation will now be given for an information flow graph controlsystem according to the embodiment that prepares and processes the abovedescribed information flow graph.

FIG. 2 is a diagram showing the configuration of the information flowgraph control system according to the embodiment.

In FIG. 2, a data knowledge manager 100 holds an information flow graphand a database for performing data processing. An interactive dataknowledge operating unit 200 provides an interactive interface to searchfor or to process data or knowledge. A data processing hardware unit 300performs internal data processing. And an interactive processinghardware unit 400 presents information to and accepts requests from auser.

In the actual system, the data knowledge manager 100, which is virtuallyprovided by software for the data processing hardware unit 300, and theinteractive data knowledge operating unit 200, which is virtuallyprovided by software for the interactive processing hardware unit 400,process information using the information flow graph.

FIG. 3 is a detailed diagram for explaining the arrangement of the dataprocessing hardware unit 300 and of the interactive processing hardwareunit 400, which are the two hardware blocks provided for the informationflow graph control system in FIG. 2.

In FIG. 3, the data processing hardware unit 300 includes a centralprocessing unit (CPU) 301 for performing calculations and a main memory302. The CPU 301 and the main memory 302 are connected to variousauxiliary storage devices via a bus 303 and either an IDE controller 311or a SCSI controller 315. The auxiliary storage devices are hard diskdrives (HDDs) 312 and 318, and drives for storage media, such as CD-ROMs313 and 317, DVDs 314 and 319 and an MO 36. A floppy disk drive (FDD)310 is also connected via a floppy disk controller (FDC) 309 to the bus303.

A floppy disk is loaded into the floppy disk drive 310. Computerprograms, which interact with an operating system and which, toimplement the embodiment, issue commands to the CPU 301, or code or datafor an operating system can be stored on the floppy disk, the hard diskdrives 312 and 318, the CD-ROMs 313 and 317 and the DVDs 314 and 319, aswell as in a ROM 304. When these computer programs are loaded into themain memory 302, the processes in the embodiment, which will bedescribed later, are performed. The code for the computer programs maybe compressed or may be divided into multiple code segments, and theresultant code segments recorded on multiple storage media. The programsor the code segments may be recorded on a storage medium, such as afloppy disk, which can then be loaded into another computer.

A printer or a modem can be connected to the bus 303 via a parallel port306 or a serial port 305, and the complete system can be connected to anetwork via the serial port 305 and the modem, or via a communicationadaptor 308 (the ethernet or a token ring), thereby enabling it tocommunicate with other computers or servers. And a remotetransmission/reception device is connected to the serial port 305 or theparallel port 306 to exchange data using infrared rays or radio.

The interactive processing hardware unit 400 includes as input devices akeyboard 402, a pointing device (a mouse or a joy stick) 403 and amicrophone 412, and includes as output devices a display device 407, amonitor (CRT) 408 and a loudspeaker 411. Preferably, the interactiveprocessing hardware unit 400 employs the pointing device 403 to performa requested operation for a GUI (Graphical User Interface). The keyboard402 and the pointing device 403 are connected via the keyboard/mousecontroller 401 to the bus 303 of the data processing hardware unit 300.And the display device 407 and the CRT 408 are connected to the bus 303via a controller (DAC/LCDC) 406 and a video graphic accelerator (VGA)404.

The audio controller 409 performs D/A (digital/analog) conversion for asound signal or a voice signal, and transmits the resultant signal viaan amplifier 410 to the loudspeaker 411, through which the signal isoutput as sound or as a voice. The audio controller 409 also performsA/D (analog/digital) conversion for voice information that is receivedthrough the microphone 412 so as to acquire external voice informationfor the system. These hardware units and the voice recognitionapplication software may be employed for entering voice commands,instead of commands that are entered using the keyboard 402 or thepointing device 403. And the application software for voice output maybe employed to read and orally reproduce information shown on the CRT408.

It can be easily understood that the information flow graph controlsystem in this embodiment can be implemented by using various types ofcomputer systems, such as an ordinary personal computer (PC) orworkstation, a notebook PC, a palmtop PC and a network computer;electric home appliances, such as televisions that incorporate computersystems; or combinations of such systems. These components are merelyexamples, and not all them are requisite components of the presentinvention.

FIG. 4 is a detailed diagram for explaining the arrangements of the dataknowledge manager 100 and the interactive data knowledge operating unit200, which are software blocks that form part of the information flowgraph control system in FIG. 2.

In FIG. 4, the data knowledge manager 100 includes a system databasemanager 110; an information flow graph manager 120, for managing theinformation flow graph as knowledge for using data; and a data knowledgerequest processor 130, for handling information requests issued by auser. The interactive data knowledge operating unit 200 includes a datarequest processor 210, for detecting, processing and displaying data;and a knowledge request processor 220, for searching for, processing anddisplaying knowledge that is represented by the information flow graph.

The data knowledge request processor 130 interprets requests transmittedfrom a user via the interactive data knowledge operating unit 200, for aprocess for searching, processing and displaying data using theinformation flow graph. Then, the data knowledge request processor 130transmits the received requests to the database manager 110 or theinformation flow graph manager 120, and receives the results obtained bythe processing of the requests, following which the data knowledgerequest processor 130 transmits the processing results to theinteractive data knowledge operating unit 200. The data knowledgerequest processor 130 also includes a data knowledge request log 131, inwhich a history of the requests accepted from the user is stored and isused to define a new information flow graph.

The database manager 110 manages database document data 111, andperforms a search using a database search language, such as SQL, orperforms a similarity search or a full-text search using a key word fordocument data. Further, the database manager 110 performs a databasefunction, such as the addition, deletion or editing of data.

The information flow graph manager 120 performs search, addition ordeletion processes for an information flow graph 121 that conveysknowledge in order to search or to synthesize a database or documentdata. As is described above, since the information flow graph 121employs as a node the description of a search form, and employs as anarc the description of an annotation or a conditional branch, theinformation flow graph manager 120 processes a variety of searchrequests for the information flow graph 121, such as a search performedfor a graph based on the information supplied for the node or the arc.

The data request processor 210 of the interactive data knowledgeoperating unit 200 includes a data search processor 211, a data displayprocessor 212 and a data search operation storage unit 213. The datasearch processor 211 accepts a data search request from the user, suchas an SQL query, a keyword search or a full-text search, and requeststhat the data knowledge request processor 130 perform the searchprocess. When the search results are received from the data knowledgerequest processor 130, they are temporarily stored in the data searchoperation storage unit 213. Then, the data display processor 212presents the results to the user by displaying them on the CRT 408 ofthe interactive processing hardware unit 400 in FIG. 3.

The data display processor 212 can display the search results so thatthey can be easily understood, by employing a variety of datavisualization methods, such as coloring, that are generally employed fora presentation. But further, means for confirming the usefulness of thesearch results is provided in order to register a series of data searchrequests that can be usefully employed for the information flow graph.This means will be described later.

The knowledge request processor 220 includes a knowledge searchprocessor 221, a knowledge synthesis/display processor 222 and aknowledge search operation storage unit 223. When a user searches forknowledge used for searching for or processing data, the knowledgesearch processor 221 accepts from the user a search request for theinformation flow graph, and analyzes the request. The knowledge searchprocessor 221 then requests that the data knowledge request processor130 perform the search based on the obtained request. Then, when thesearch results are returned by the data knowledge request processor 130,they are temporarily stored in the knowledge search operating storageunit 223. Thereafter, the knowledge synthesis/display processor 222presents the search results for the user by displaying them on the CRT408 of the interactive processing hardware unit 400 in FIG. 3.

The knowledge synthesis/display processor 222 can display the searchresults so that they can be easily understood by employing a graphvisualization method that is generally employed for a presentation.Furthermore, a new information flow graph can be generated bysynthesizing multiple information flow graphs.

An explanation will now be given for the processing performed by thedata knowledge manager 100 and the interactive data knowledge operatingunit 200 in the information flow graph control system according to theembodiment.

As is described above, the information flow graph 121 in this embodimentis used to write information defined by the search form, and to performthe collection and the analysis of information in accordance with aspecific object. Therefore, similar information requests can be searchedfor and synthesized by using a difference between target information,not a conventionally employed procedural difference that is analyzed bya transaction or the work flow in the database. Thus, means can beprovided for the re-use of the knowledge that is used to collect or toanalyze information for knowledge management.

Specifically, processes are performed for obtaining the log for theinformation search and analysis procedures used to generate a newinformation flow graph 121, for searching conventional information flowgraphs 121, and for evaluating and processing the conventionalinformation flow graph 121. Each of these processes will now bedescribed.

FIG. 5 is a flowchart for explaining the processing performed to preparea new information flow graph 121.

In FIG. 5, first, a search request command and an analysis requestcommand are input to and selected by the interactive data knowledgeoperating unit 200, and are transmitted to the data request processor210 (step 501). The search request is then transmitted by the datasearch processor 211 in the data request processor 210 to the dataknowledge request processor 130 of the data knowledge manager 100, andis processed by the database manager 110. The database manager 110returns the results obtained by the search of the database document data111 to the data search processor 211 of the data request processor 210,where they are temporarily stored in the data search operation storageunit 213 and are displayed by the data display processor 212. Whilereferring to the search results on the display, a user can issue afurther search request or analysis request. When this process isrepeated, the series of operations that are performed before the userobtains the desired results is stored as a log Q in the data knowledgerequest log 131.

When program control shifts to the knowledge request processor 220 ofthe interactive data knowledge operating unit 200, the log Q stored inthe data knowledge request log 131 is read and displayed by theknowledge synthesis/display processor 222 (step 502). The log Q isdisplayed as a graph wherein the search forms are employed as nodes andthe nodes are connected by arcs in the order in which they are executed.The user edits the log Q on the display by attaching labels to the nodesor the arcs or by modifying default labels that are provided by thesystem (step 503).

The log Q obtained by the editing is transmitted by the knowledgesynthesis/display processor 222, via the data knowledge requestprocessor 130, to the information flow graph manager 120, and is managedas an information flow graph 121 (step 504). When the name of thedatabase that was searched or the search form corresponds to the node,it means that the same database was searched as during the searchprocess performed for nodes having the same label. Therefore, in thesucceeding process for searching for the information flow graphs 121,containing similar information flow graphs 121 can be effectively foundby matching the nodes. Similarly, when the attribute name, the searchcommand name or the analysis command name corresponds to the arch,similar information flow graphs 121 can be easily searched for.

FIG. 6 is a flowchart for explaining the process for searching for theconventional information flow graph 121.

In FIG. 6, to search for the information flow graph 121, first, theinformation flow graph 121 that includes a node and an arc havingspecific labels is designated and is submitted to the knowledge searchprocessor 221 as a search request. This search request is transmitted bythe knowledge search processor 221, via the data knowledge requestprocessor 130, to the information flow graph manager 120. Theinformation flow graph manager 120 initiates the search in accordancewith the search request (step 601), and reads the information flow graph121 that matches the search condition. The information flow graph 121 isthen temporarily stored in the knowledge search operation storage unit223 of the knowledge request processor 220, and is displayed by theknowledge synthesis/display processor 222. When no information flowgraph 121 is found that matches the designated search condition, amessage to that effect is issued to the user. After the user modifiesthe search condition, a search for the information flow graph isperformed again, based on under the modified search condition (steps 602and 603).

When an information flow graph 121 is found that satisfies thedesignated search condition, the user determines whether the informationflow graph 121 that was found is the desired one. If the obtainedinformation flow graph 121 is not the desired graph, the searchcondition is modified and the search is performed again under themodified search condition (steps 604 and 603).

When the information flow graph 121 that is found is the desired one,this information flow graph 121 is selected in order that the processingor editing of that information flow graph 121 can be performed (step605).

For the search for the information flow graph 121, even when anannotation attached to an arc is not necessarily the same, aninformation flow graph that matches the search condition can be found.However, the arcs that correspond to the conditional branches can bematched only under the same condition. In order to efficiently match theportions of the graphs, an effective means is to limit the searchqueries that can be represented by nodes. For example, the search querymay be limited to only a keyword search. Since for information flowgraphs 121 that have the same prefix their common portions are evaluatedat the same time, and only those portions that are different areevaluated separately, a search can be performed more efficiently.

The operation for the evaluation and the processing of the informationflow graph 121 will now be described.

Technically, the processing of the information flow graph 121 consistsof the above described search and editing that is performed, such as thedivision or the connection of the information flow graph 121. However,since the information flow graph 121 describes the informationcollection and analysis process, multiple information flow graphs 121that describe multiple information collection and analysis processes areevaluated or processed in accordance with a predetermined object, sothat new information utilization means can be provided. For example,based on a specific search condition, a list of information flow graphs121 that can utilize the information can be examined, and an informationutilization method used by a third party can be learned. For theinformation utilization means, the three that follow will be explained.

-   -   1. Detailed graph generation: A single information request is        reinforced by using a more detailed information request.    -   2. Case generation: For information requests that include common        portions, information reflecting two different viewpoints are        collected and analyzed.    -   3. Correlation: All the graph portions that include specified        common nodes or specified common paths (multiple nodes and arcs        connecting the nodes) are obtained.

Each process will now be described.

Generation of Detailed Information Flow Graph

FIG. 7 is a diagram for explaining the generation of a more detailedinformation flow graph 121.

Assume that a user (a) performs an operation for “obtaining from today'snews the names of the top ten companies in the descending order of thefrequency of their appearance”, and that another user (b) performs anoperation for “obtaining from today's news the names of the top tencompanies in the descending order of the frequency of their appearance”,and from among the companies that are thus selected, “selectingcompanies that are ranked in the top 500 by Forbes”. The operationsperformed by the users (a) and (b) can be written as information flowgraphs a and b, as in FIG. 7. The updating from the information flowgraph a to the information graph b involves the generation of a detailedinformation flow graph 121.

The two information flow graphs are the same for the route advancingfrom the start node A to the node B, whereat the information request for“obtaining from today's news the names of the top ten companies in thedescending order of the frequency of their appearance” is written.However, the information flow graph b differs from the information flowgraph a in that a node C is added, whereat the information request isadded for “selecting companies that are ranked in the top 500 byForbes”, and an arc is extended from node B to node C.

Therefore, the user (a) can learn that a more detailed informationrequest for “selecting companies ranked in the top 500 by Forbes” can beadditionally issued after the operation he or she performed (theoperation represented by the information flow graph a).

Further, before performing the operation represented by the informationflow graph b, the user (b) can search for and obtain the informationflow graph a that is already present, and can then efficiently acquirethe information available at node B without having to resort to trialand error to obtain it. It may be difficult to understand the importanceof this because the portion that the flow graphs a and b have in commonin FIG. 7 is so simple to apprehend; however, for a complicated processthat requires multiple operations before node B (the final node whereatinformation that is used in common can be obtained) is reached, the userneed not rely on trial and error to repeat all the operations. As aresult, this process is very effective.

FIG. 8 is a flowchart for explaining the processing for generating adetailed information flow graph 121.

In FIG. 8, a user designates a search condition and an analysisoperation that is added to the information flow graph 121 that isselected for processing (step 801). While confirming the searchcondition and the analysis results displayed by the data requestprocessor 210, the user prepares a log in the same manner as one iscreated for a new information flow graph 121.

The search and analysis processing at step 801 is repeated until desiredsearch or analysis results are obtained. And when the desired resultshave been obtained, the search and analysis processing is terminated(step 802) and the data knowledge request log 131 that is obtained isemployed to prepare an information flow graph 121 that includes theresults obtained by the search and analysis processing performed at step801. Labels are then added to new arcs and nodes, and the informationflow graph 121 is stored in the information flow graph manager 120 (step803).

Case Generation of the Information Flow Graph

FIG. 9 is a diagram for explaining the state wherein case generation ofthe information flow graphs 121 is performed in accordance with thecase.

Assume a case wherein a user (a) performs an operation for “obtainingfrom today's news the names of the top ten companies in the descendingorder of the frequency of their appearance”, and from the companies thatare thus obtained, “selecting companies that increased their income andtheir profits last year”; and wherein a user (b) performs an operationfor “obtaining from today's news the names of the top ten companies inthe descending order of the frequency of their appearance”, and from thecompanies that are thus selected, “selecting companies ranked in the top500 by Forbes”. The operations of the users (a) and (b) can be writtenas the information flow graphs a and b in FIG. 9.

The two information flow graphs are the same as the route advancing fromthe start node A to the node B, whereat is written the informationrequest to “obtain from today's news the names of the top ten companiesin the descending order of the frequency of their appearance”. However,these graphs differ in that, in the information flow graph a, there area node C′, whereat is written the information request for “selectingcompanies that increased their income and their profits last year”, andan arc extending from node B to node C′, and that, in the informationgraph b, there are a node C, whereat is written the information requestfor “selecting companies ranked in the top 500 by Forbes”, and an arcextending from node B to node C.

Therefore, the users a and b can mutually recognize that differentinformation can be acquired by referring to an operation similar to theone they performed. The like portions of the two information flow graphsare united, and the information flow graphs that include a differentportion as an arc are regarded as their own information flow graphs.Thus, based on a similar operation, more information can be obtained asneeded.

Further, as well as in the generation of a detailed information flowgraph, a user who performs a predetermined operation and who desires toobtain information before node B is reached can employ a differentinformation flow graph that, in accordance with the case, is searchedfor during the case generation.

FIG. 10 is a flowchart for explaining the process for case generationfrom the information flow graph 121 in accordance with the case.

In FIG. 10, upon the receipt of a search request from a user, theinformation flow graph 121 that begins the designated path (a series ofnodes that are connected by one or more arcs), or a second informationflow graph that begins with the same path as that of the informationflow graph 121 that is selected for processing, is searched for by theknowledge request processor 220 (step 1001). This request is handled bythe data knowledge request processor 130 and the information flow graphmanager 120, and the information flow graph 121 that satisfies thesearch request is returned to the knowledge search operation storageunit 223.

If a solution for the search (an information flow graph 121 that matchesthe search request) is not present, the search condition is modified, oranother information flow graph 121 is selected, and the search isperformed again (steps 1002 and 1003).

If only one information flow graph 121 that begins with the pathdesignated at step 1001 is present in the solution obtained by thesearch, again, the search condition is modified or another informationflow graph 121 is selected, and a new search is performed (steps 1004and 1003). In this case, each information flow graph 121 may beevaluated by the data knowledge request processor 130, and the search oranalysis results that are actually generated may be confirmed.

When, at step 1004, a plurality of target information flow graphs 121are found, they are selected. Then, the knowledge synthesis/displayingprocessor 222 unites the common portions of the information flow graphs121 using one path, and generates a single information flow graph 121.The newly obtained information flow graph 121 is stored in theinformation flow graph manager 120 (step 1005).

Correlation of the Information Flow Graph

FIG. 11 is a diagram for explaining the process used for correlating theinformation flow graphs 121.

In FIG. 11, three information flow graphs having a node that describes“obtaining from today's news the names of the top ten companies in thedescending order of their frequency of appearance” are collected at thepertinent node. Therefore, the information flow graphs that arecollected at this node as a key include an operation for “obtaining fromtoday's news the names of the top ten companies in the descending orderof their frequency of appearance” as a process or as the resultsobtained by a series of specific operations.

When the user analyzes these information flow graphs, he or she canunderstand, based on the operation performed for “obtaining from today'snews the names of the top ten companies in the descending order of theirfrequency of appearance”, what information search route is presentbefore the information is reached, and what kind of information can beobtained. In addition, the user can combine required (or interesting)information flow graphs to form his or her own information flow graph.

In the example in FIG. 11, multiple information flow graphs arecollected at the node that is used in common; however, the informationflow graphs may be collected at an arc having the same label, or byusing a path consisting of several nodes and arcs, as in the abovedescribed case generation.

FIG. 12 is a flowchart for explaining the processing for correlating theinformation flow graphs 121.

In FIG. 12, the user issues a search request while designating a desirednode or arc, and upon the receipt of this search request, theinformation flow graph manager 120 searches for all the information flowgraphs 121 that include the designated node or arc (step 1201).

If the solution for the search (the information flow graph 121 thatsatisfies the search request) is not present, the search condition ismodified and a new search is performed (steps 1202 and 1203).

If only one information flow graph 121 that includes the node or arcdesignated at step 1201 is present as the solution, the search conditionis also modified and a new search is performed (steps 1204 and 1203).

If, at step 1204, multiple target information flow graphs 121 are found,the user analyzes these information flow graphs 121 and selects adesired graph (step 1205). When the selected information flow graph 121is stored as the user's information flow graph 121 in the informationflow graph manager 120, thereafter, this graph 121 can be used as aguideline for the performance of an operation, can be compared withanother information flow graph 121, or can be edited, so as to generatea more detailed graph, or the graph may be generated in accordance withthe case.

Through the above processing, the information flow graph control systemin this embodiment can describe an operation performed by a user bypreparing an information flow graph 121 and storing the information flowgraph 121. Thus, the user can employ the information flow graph as areference when performing the same or a similar operation.

Further, it is easy to compare various operations and to select a moreefficient operation, or to obtain an associated operation.

The above described evaluation and processing method for the informationflow graph 121 is merely an example, and a common information evaluationor processing method using the graph can also be employed for theinformation flow graph 121.

When the information flow graph 121 is regarded as one of data formsused by a computer system that implements the information flow graphcontrol system, various information processes using the information flowgraph 121 are available. For example, as is described above, theinformation flow graph 121 can be interpreted as a script for collectingor searching a series of related information. Therefore, the informationflow graph control system can read a predetermined information flowgraph 121 and automatically perform an operation written in that graph.Furthermore, when the information flow graph 121 is represented as aradar chart according to an appropriate rule, the information collectedusing the information flow graph 121 can be visualized.

An example application for the information flow graph 121 as a radarchart will now be described.

When the information flow graph 121 is used as a radar chart, it ispremised that the data obtained through the operations indicated by therespective nodes of the information flow graph 121 must be correlatedwith the nodes. The operation items indicated by the respective nodesand the data obtained for the individual items are displayed as a list,together with the radar chart.

FIG. 13 is a diagram showing a radar chart using the information flowgraph 121 and a list of obtained data for the radar chart.

In a radar chart 1301 in FIG. 13, operation items indicated by theindividual nodes of the information flow graph 121 are arranged aroundthe circumference of a circle, and conditions for these operations arerepresented by using the distance from the center of the circle to thecircumference. For example, for an item “obtaining from today's news thenames of the companies in the descending order of the frequency of theirappearance”, a condition whereby to ascertain how many companies namesare to be obtained can be represented by using the distance from thecenter of the circle. According to this rule, each node of theinformation flow graph 121 is arranged at the location of thecorresponding condition of the corresponding item. It should be notedthat because of the radar cart properties, in the radar chart 1301, thearcs connecting the nodes do not have directions. That is, the order inwhich operations are executed is not especially considered.

In a list 1302 in FIG. 13, data that satisfies a condition specified bythe location of a node is displayed for each item on the radar chart1301. Further, when the population of the pertinent data are the same,i.e., when the data are obtained from the same database for all theitems, a set 1303 of data that satisfy all of these conditions may alsobe obtained.

As the user interface, not only is the radar chart 1301 displayed, butit can also be used as a GUI operation tool. Specifically, since thelocation of a node in the radar chart 1301 is correlated with theinformation obtained through the operation indicated by the pertinentnode, an operation, performed after the radar chart 1301 is displayed,whereby the node provided for each corresponding item is slid along thecircumference of a circle and the distance from the center of the circleis changed can be correlated with a change in the search condition forthe pertinent operation. Thus, the contents of the data presented in thelist 1302 can be changed by an interactive and intuitive operationwhereby a node on the radar chart 1301 is moved by using a pointingdevice, such as a mouse.

Further, if the population of the data remain the same, a predeterminednode can be fixed, and other nodes can be moved so that the same data asthat obtained by an operation that corresponds to the predetermined nodeis obtained. Then, the shape of the radar chart 1301 that includes thisdata as the same portion can be examined and evaluated.

FIG. 14 is a flowchart for explaining the information processingperformed using the radar chart 1301.

In FIG. 14, first, the data request processor 210 and the data knowledgerequest processor 130 obtain data sets for corresponding nodes, andstore them in the data search operation storage unit 213 (step 1401).Then, the nodes of a selected information flow graph 121 are representedby the knowledge synthesis/display processor 222 using the radar chart1301 (step 1402).

Thereafter, the user performs a desired operation for the radar chart1301 on the display. In this example, the user can selectively perform abrowsing operation for the data of the individual nodes in the radarchart 1301, an operation for fixing a specific node and correlating theother nodes having like data, an operation for obtaining the sameportion in the data for the nodes, and an operation for changing theattribute of the axis that corresponds to the node.

When the browsing of the data is selected, the information flow graphcontrol system transmits a search request for each node to the databasemanager 110 via the data search processor 211 and the data knowledgerequest processor 130, and transmits the search results as the list 1302to the knowledge synthesis/display processor 222, so that the user cansee the data corresponding to the respective nodes on the radar chart1301 (steps 1403 and 1404).

When the user selects an operation for fixing a specific node andcorrecting other nodes having the same data, the information flow graphcontrol system obtains data correlated with the fixed node from the datarequest processor 210 and the data search operation storage unit 213.The other nodes in the radar chart 1301 are moved so as to correspond tothe search results, and are displayed again (steps 1405 and 1406). Whenthere is a node on the radar chart 1301 that can not be correlated withthe selected data, the operation fails (error).

When the user selects an operation for obtaining the same portion in thedata for the nodes, the information flow graph control system determineswhether the same portion is present in all the data sets that correspondto the nodes on the radar chart 1301. When the same portion is present,the data search processor 211 stores the data set in the data searchoperation storage unit 213, and the data set for the common portion isdisplayed by the knowledge synthesis/display processor 222 (steps 1407and 1408).

When the user selects an operation for changing the attribute of theaxis that corresponds to the node (e.g., when corresponding data havemultiple attributes, such as a record of an associated database, theattribute of the axis is changed from the number of data sets to theprice value set for the data), the information flow graph control systemchanges the attribute of a target axis in the radar chart 1301, and thencorrelates the upper and lower ends of the axis with the maximum andminimum available values (for a non-numerical attribute, the values ofthe first and the last elements that are arranged in proper order). Theinformation for the radar chart 1301 stored in the knowledge searchoperation storage unit 223 is updated, and the updated radar chart 1301is again displayed by the knowledge synthesis/display processor 222(step 1409 and 1410).

Thereafter, to terminate the processing for the information flow graph121 that is currently being handled, the information flow graph 121 isstored in the information flow graph manager 120. When this is done, theprocessing can be terminated (step 1411).

As is described above, according to the present invention, aninformation flow graph can be employed to describe information that isdefined by a search form and an action by which information for aspecific purpose is collected and analyzed, and new informationcollection and analysis means for knowledge management can be provided.

According to the present invention, a knowledge expression can beimplemented with which it is easy to identify similarities betweengraphs wherein information and the act of collecting and analyzing itare described, and to re-use a graph that has been prepared.

1. An information processing system comprising: log acquisition means,for obtaining a log for operations performed during informationprocessing; graph preparation means, for setting, as nodes on a graph,said operations of said log obtained by said log acquisition means, andfor connecting said nodes with arcs in the order of the performance ofsaid operations to prepare a graph that represents a transient conditionwherein said operations are shifted; graph editing means, for editingsaid prepared graph by dividing said graph at an arbitrary location andconnecting an arbitrary node to an arbitrary arc, graph storage means,for storing said graph that is prepared; graph search means, forsearching for said graph stored in said graph storage means using, as asearch key, an arbitrary node or arc, or a path consisting of a sequenceof nodes and arcs, information processing means, for employing saidgraph as a script, and for mechanically performing operations specifiedat said nodes of said graph in the order indicated by said arcs in saidgraph; and graph display means, for visually presenting said graphprepared by said graph preparation means.
 2. The information processingsystem according to claim 1, wherein said graph display means displayssaid graph detected by said search means.
 3. The information processingsystem according to claim 1, wherein said graph display means displayssaid graph edited by said graph display means.
 4. The informationprocessing system according to claim 1, further comprising: radar chartpreparation means, for arranging operations for information processingaround the circumference of a circle and preparing a radar chart thatrepresents conditions for said operations using distances from thecenter of said circle, and for arranging and displaying said nodes ofsaid graph at predetermined locations on said radar chart; and listpreparation means, for preparing a list wherein said nodes on said radarchart are correlated with the results obtained by operationscorresponding to said nodes.
 5. An information processing methodcomprising the steps of: obtaining a log for operations performed duringinformation processing; setting, as nodes on a graph, said operationsrecorded in said log, and connecting said nodes with arcs, in the orderin which said operations are performed, to prepare a graph representinga transient condition wherein said operations are shifted; and visuallypresenting said prepared graph; storing and accumulating graphs that areprepared; searching for a different graph that includes all or part of apredetermined graph representing a predetermined operating sequence, andthat has a node corresponding to a preceding or succeeding operation;adding, to said predetermined graph, said node that corresponds to saidpreceding or succeeding operation of the common portion of saiddifferent graph, and an arc extended to said node; storing andaccumulating graphs that are prepared; searching for graphs thatcorrespond to an operating sequence whereby predetermined operatingresults are available; and selecting a desired graph from among saidgraphs obtained by the search, and connecting said desired graph to agraph that corresponds to another operation for which the resultsobtained through an operation consonant with said desired graph areemployed.
 6. The information processing method according to claim 5,further comprising the step of: arranging operating items forinformation processing around the circumference of a circle andpreparing a radar chart that represents conditions for said operationsusing distances from the center of said circle, and arranging anddisplaying said nodes of said graph at predetermined locations on saidradar chart.
 7. A computer program which permits a computer to perform:a process for obtaining a log for operations during informationprocessing; a process for setting, as nodes on a graph, said operationsrecorded in said obtained log, and for connecting said nodes with arcsin the order of the performance of said operations to prepare graphsthat represent a transient condition wherein said operations areshifted; a process for accumulating said graphs that are prepared; aprocess for searching for a desired graph using, as a search key, anarbitrary node or arc, or a path consisting of a sequence of nodes andarcs; a process for editing said graph that is prepared or said desiredgraph that is obtained by the search; a process for employing said graphas a script, and for mechanically performing operations specified atsaid nodes of said graph in the order indicated by said arcs in saidgraph; and a process for visually presenting said graph provided byediting.
 8. A storage medium on which input means of a computer stores acomputer-readable program that permits a computer to perform: a processfor obtaining a log for operations during information processing; aprocess for setting, as nodes on a graph, said operations recorded insaid obtained log, and for connecting said nodes with arcs in the orderof the performance of said operations to prepare graphs that represent atransient condition wherein said operations are shifted; a process foraccumulating said graphs that are prepared; a process for searching fora desired graph using, as a search key, an arbitrary node or arc, or apath consisting of a sequence of nodes and arcs; a process for employingsaid graph as a script, and for mechanically performing operationsspecified at said nodes of said graph in the order indicated by saidarcs in said graph; and a process for editing said graph that isprepared or said desired graph that is obtained by the search; and aprocess for visually presenting said graph provided by editing.
 9. Thestorage medium according to claim 8, wherein said program permits saidcomputer to perform: a process, for arranging operations for informationprocessing around the circumference of a circle and preparing a radarchart that represents conditions for said operations using distancesfrom the center of said circle, and for arranging and displaying saidnodes of said graph at predetermined locations on said radar chart. 10.A program transmission apparatus comprising: storage means for storing acomputer-readable program that permits a computer to perform a processfor obtaining a log for operations during information processing, aprocess for setting, as nodes on a graph, said operations recorded insaid obtained log, and for connecting said nodes with arcs in the orderof the performance of said operations to prepare graphs that represent atransient condition wherein said operations are shifted, a process foraccumulating said graphs that are prepared, a process for searching fora desired graph using, as a search key, an arbitrary node or arc, or apath consisting of a sequence of nodes and arcs, a process for editingsaid graph that is prepared or said desired graph that is obtained bythe search, a process, for arranging operations for informationprocessing around the circumference of a circle and preparing a radarchart that represents conditions for said operations using distancesfrom the center of said circle, and for arranging and displaying saidnodes of said graph at predetermined locations on said radar chart; anda process for visually presenting said graph provided by editing; andtransmission means for reading said computer-readable program from thestorage means and transmitting said computer-readable program.
 11. Aninformation processing system comprising: log acquisition means, forobtaining a log for operations performed during information processing;graph preparation means, for setting, as nodes on a graph, saidoperations of said log obtained by said log acquisition means, and forconnecting said nodes with arcs in the order of the performance of saidoperations to prepare a graph that represents a transient conditionwherein said operations are shifted; and graph editing means, forediting said prepared graph by dividing said graph at an arbitrarylocation and connecting an arbitrary node to an arbitrary arc, graphstorage means, for storing said graph that is prepared; graph searchmeans, for searching for said graph stored in said graph storage meansusing, as a search key, an arbitrary node or arc, or a path consistingof a sequence of nodes and arcs, information processing means, foremploying said graph as a script, and for mechanically performingoperations specified at said nodes of said graph in the order indicatedby said arcs in said graph; radar chart preparation means, for arrangingoperations for information processing around the circumference of acircle and preparing a radar chart that represents conditions for saidoperations using distances from the center of said circle, and forarranging and displaying said nodes of said graph at predeterminedlocations on said radar chart; and list preparation means, for preparinga list wherein said nodes on said radar chart are correlated with theresults obtained by operations corresponding to said nodes; and graphdisplay means, for visually presenting said graph.
 12. A storage mediumon which input means of a computer stores a computer-readable programthat permits a computer to perform: a process for obtaining a log foroperations during information processing; a process for setting, asnodes on a graph, said operations recorded in said obtained log, and forconnecting said nodes with arcs in the order of the performance of saidoperations to prepare graphs that represent a transient conditionwherein said operations are shifted; a process for accumulating saidgraphs that are prepared; a process for searching for a desired graphusing, as a search key, an arbitrary node or arc, or a path consistingof a sequence of nodes and arcs; a process for employing said graph as ascript, and for mechanically performing operations specified at saidnodes of said graph in the order indicated by said arcs in said graph; aprocess for editing said graph that is prepared or said desired graphthat is obtained by the search; and a process for visually presentingsaid graph provided by editing and a process, for arranging operationsfor information processing around the circumference of a circle andpreparing a radar chart that represents conditions for said operationsusing distances from the center of said circle, and for arranging anddisplaying said nodes of said graph at predetermined locations on saidradar chart.